Oriented Matroids -- Combinatorial Structures Underlying Loop Quantum Gravity

We analyze combinatorial structures which play a central role in determining spectral properties of the volume operator in loop quantum gravity (LQG). These structures encode geometrical information of the embedding of arbitrary valence vertices of a graph in 3-dimensional Riemannian space, and can be represented by sign strings containing relative orientations of embedded edges. We demonstrate that these signature factors are a special representation of the general mathematical concept of an oriented matroid. Moreover, we show that oriented matroids can also be used to describe the topology (connectedness) of directed graphs. Hence the mathematical methods developed for oriented matroids can be applied to the difficult combinatorics of embedded graphs underlying the construction of LQG. As a first application we revisit the analysis of [4-5], and find that enumeration of all possible sign configurations used there is equivalent to enumerating all realizable oriented matroids of rank 3, and thus can be greatly simplified. We find that for 7-valent vertices having no coplanar triples of edge tangents, the smallest non-zero eigenvalue of the volume spectrum does not grow as one increases the maximum spin \jmax at the vertex, for any orientation of the edge tangents. This indicates that, in contrast to the area operator, considering large \jmax does not necessarily imply large volume eigenvalues. In addition we give an outlook to possible starting points for rewriting the combinatorics of LQG in terms of oriented matroids.Comment: 43 pages, 26 figures, LaTeX. Version published in CQG. Typos corrected, presentation slightly extende

Realizability of Polytopes as a Low Rank Matrix Completion Problem

This article gives necessary and sufficient conditions for a relation to be the containment relation between the facets and vertices of a polytope. Also given here, are a set of matrices parameterizing the linear moduli space and another set parameterizing the projective moduli space of a combinatorial polytope

Small grid embeddings of 3-polytopes

We introduce an algorithm that embeds a given 3-connected planar graph as a convex 3-polytope with integer coordinates. The size of the coordinates is bounded by $O(2^{7.55n})=O(188^{n})$. If the graph contains a triangle we can bound the integer coordinates by $O(2^{4.82n})$. If the graph contains a quadrilateral we can bound the integer coordinates by $O(2^{5.46n})$. The crucial part of the algorithm is to find a convex plane embedding whose edges can be weighted such that the sum of the weighted edges, seen as vectors, cancel at every point. It is well known that this can be guaranteed for the interior vertices by applying a technique of Tutte. We show how to extend Tutte's ideas to construct a plane embedding where the weighted vector sums cancel also on the vertices of the boundary face

Six topics on inscribable polytopes

Inscribability of polytopes is a classic subject but also a lively research area nowadays. We illustrate this with a selection of well-known results and recent developments on six particular topics related to inscribable polytopes. Along the way we collect a list of (new and old) open questions.Comment: 11 page

Polytopality and Cartesian products of graphs

We study the question of polytopality of graphs: when is a given graph the graph of a polytope? We first review the known necessary conditions for a graph to be polytopal, and we provide several families of graphs which satisfy all these conditions, but which nonetheless are not graphs of polytopes. Our main contribution concerns the polytopality of Cartesian products of non-polytopal graphs. On the one hand, we show that products of simple polytopes are the only simple polytopes whose graph is a product. On the other hand, we provide a general method to construct (non-simple) polytopal products whose factors are not polytopal.Comment: 21 pages, 10 figure

Intersecting Solitons, Amoeba and Tropical Geometry

We study generic intersection (or web) of vortices with instantons inside, which is a 1/4 BPS state in the Higgs phase of five-dimensional N=1 supersymmetric U(Nc) gauge theory on R_t \times (C^\ast)^2 \simeq R^{2,1} \times T^2 with Nf=Nc Higgs scalars in the fundamental representation. In the case of the Abelian-Higgs model (Nf=Nc=1), the intersecting vortex sheets can be beautifully understood in a mathematical framework of amoeba and tropical geometry, and we propose a dictionary relating solitons and gauge theory to amoeba and tropical geometry. A projective shape of vortex sheets is described by the amoeba. Vortex charge density is uniformly distributed among vortex sheets, and negative contribution to instanton charge density is understood as the complex Monge-Ampere measure with respect to a plurisubharmonic function on (C^\ast)^2. The Wilson loops in T^2 are related with derivatives of the Ronkin function. The general form of the Kahler potential and the asymptotic metric of the moduli space of a vortex loop are obtained as a by-product. Our discussion works generally in non-Abelian gauge theories, which suggests a non-Abelian generalization of the amoeba and tropical geometry.Comment: 39 pages, 11 figure

Multi-triangulations as complexes of star polygons

Maximal $(k+1)$-crossing-free graphs on a planar point set in convex position, that is, $k$-triangulations, have received attention in recent literature, with motivation coming from several interpretations of them. We introduce a new way of looking at $k$-triangulations, namely as complexes of star polygons. With this tool we give new, direct, proofs of the fundamental properties of $k$-triangulations, as well as some new results. This interpretation also opens-up new avenues of research, that we briefly explore in the last section.Comment: 40 pages, 24 figures; added references, update Section

Integrating DGSs and GATPs in an Adaptative and Collaborative Blended-Learning Web-Environment

The area of geometry with its very strong and appealing visual contents and its also strong and appealing connection between the visual content and its formal specification, is an area where computational tools can enhance, in a significant way, the learning environments. The dynamic geometry software systems (DGSs) can be used to explore the visual contents of geometry. This already mature tools allows an easy construction of geometric figures build from free objects and elementary constructions. The geometric automated theorem provers (GATPs) allows formal deductive reasoning about geometric constructions, extending the reasoning via concrete instances in a given model to formal deductive reasoning in a geometric theory. An adaptative and collaborative blended-learning environment where the DGS and GATP features could be fully explored would be, in our opinion a very rich and challenging learning environment for teachers and students. In this text we will describe the Web Geometry Laboratory a Web environment incorporating a DGS and a repository of geometric problems, that can be used in a synchronous and asynchronous fashion and with some adaptative and collaborative features. As future work we want to enhance the adaptative and collaborative aspects of the environment and also to incorporate a GATP, constructing a dynamic and individualised learning environment for geometry.Comment: In Proceedings THedu'11, arXiv:1202.453